Bounds on the Lattice Point Enumerator via Slices and Projections
نویسندگان
چکیده
Abstract Gardner et al. posed the problem to find a discrete analogue of Meyer’s inequality bounding from below volume convex body by geometric mean volumes its slices with coordinate hyperplanes. Motivated this problem, for which we provide first general bound, study in more context question number lattice points terms slices, as well projections.
منابع مشابه
The Partition Weight Enumerator and Bounds on Mds Codes
Maximum Distance Separable (MDS) codes are those error correction codes that meet the singleton bound, thus they have the largest minimum distance possible. The main research problem is to find an upper bound on the length of the codewords when the alphabet size and dimension of the code are fixed. This paper will present a new technique using the Partition Weight Enumerator for solving this pr...
متن کاملTight Variational Bounds via Random Projections and I-Projections
Information projections are the key building block of variational inference algorithms and are used to approximate a target probabilistic model by projecting it onto a family of tractable distributions. In general, there is no guarantee on the quality of the approximation obtained. To overcome this issue, we introduce a new class of random projections to reduce the dimensionality and hence the ...
متن کاملImproved Bounds on Sidon Sets via Lattice Packings of Simplices
A Bh set (or Sidon set of order h) in an Abelian group G is any subset {b0, b1, . . . , bn} ⊂ G with the property that all the sums bi1 + · · ·+ bih are different up to the order of the summands. Let φ(h, n) denote the order of the smallest Abelian group containing a Bh set of cardinality n+1. It is shown that, as h → ∞ and n is kept fixed, φ(h, n) ∼ 1 n! δl(△) h n , where δl(△ ) is the lattice...
متن کاملSpreading Estimates for Quantum Walks on the Integer Lattice via Power-law Bounds on Transfer Matrices
We discuss spreading estimates for dynamical systems given by the iteration of an extended CMV matrix. Using a connection due to Cantero– Grünbaum–Moral–Velázquez, this enables us to study spreading rates for quantum walks in one spatial dimension. We prove several general results which establish quantitative upper and lower bounds on the spreading of a quantum walk in terms of estimates on a p...
متن کاملSVM via Saddle Point Optimization: New Bounds and Distributed Algorithms
Support Vector Machine is one of the most classical approaches for classification and regression. Despite being studied for decades, obtaining practical algorithms for SVM is still an active research problem in machine learning. In this paper, we propose a new perspective for SVM via saddle point optimization. We provide an algorithm which achieves (1 − )-approximations with running time Õ(nd +...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2021
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-021-00310-7